Verification of Procedural Programs via Building Their Generalized Nets Models

In the article an approach for verification of procedural programs via building their corresponding generalized nets models is described. This approach integrates the concept of “design by contract” with approaches for verification of type theorem proofs and models consistency check. For this purpose, functions which compose the program, are verified separately according to their specifications. A generalized net model is built, specifying the relationships between functions in the form of correct sequences of calls. For the main function of the program, a generalized net model is built and it is checked whether it complies with the net model of relations between the functions of the program. Each function of the program, which uses other functions defined in the program, is verified also according to the specification set by the net model of relations between the functions of the program.